Two Hybrid Metaheuristic Algorithms for Hot Rolling Scheduling
نویسندگان
چکیده
منابع مشابه
Appling Metaheuristic Algorithms on a Two Stage Hybrid Flowshop Scheduling Problem with Serial Batching (RESEARCH NOTE)
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...
متن کاملTwo effective hybrid metaheuristic algorithms for minimization of multimodal functions
This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملMetaheuristic Algorithms for Hybrid Flow-Shop Scheduling Problem with Multiprocessor Tasks
This paper is concerned with hybrid flow-shop scheduling problem involving multiprocessor tasks. The hybrid flow-shop problem is a generalization of the classical flow-shop problem by permitting multiple parallel processors at each stage of task processing. The multiprocessor tasks, on the other hand, overcome the restriction of the classical scheduling problems by allowing tasks to be processe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISIJ International
سال: 2009
ISSN: 0915-1559,1347-5460
DOI: 10.2355/isijinternational.49.529